Metaphors abound in descriptions of the COVID-19 pandemic: it is described, among other things, as a war, a flood, and a marathon. However, not all metaphors may resonate equally well with members...

ABSTRACTThis article introduces the Hyperbole Identification Procedure, a first systematic method for identifying linguistic hyperbole in discourse. We start by comparing existing definitions of linguistic hyperbole. Based on the commonalities shared by these definitions, we provide our operational definition of hyperbole as “an expression that is more extreme than justified given its ontological referent.” The next section argues why it is useful to identify hyperbole, as with metaphor in Metaphor Identification Procedure Vrije Universiteit, at the level of lexical units, and (...) subsequently introduces the steps of HIP. We follow up with two sample analyses of HIP in practice. First, we show how to unitize and analyze one complete sample sentence. Second, we present sample analyses of a number of selected cases. Then we present data showing that HIP can be reliably applied to a sample corpus of Dutch news texts. We end with discussing applications and implications of using HIP in corpus research. (shrink)

After a discussion of the different treatments in the literature of vacuous descriptions, the notion of descriptor is slightly generalized to function descriptor Ⅎ $\overset \rightarrow \to{y}(x)$ , so as to form partial functions φ = Ⅎ $y(\overset \rightarrow \to{x}).A(\overset \rightarrow \to{x},y)$ which satisfy $\forall \overset \rightarrow \to{x}z(z=\phi \overset \rightarrow \to{x}\leftrightarrow \forall y(A(\overset \rightarrow \to{x},y)\leftrightarrow y=z))$ . We use (intuitionistic, classical or intermediate) logic with existence predicate, as introduced by D. S. Scott, to handle partial functions, and prove that adding (...) function descriptors to a theory based on such a logic is conservative. For theories with quantification over functions, the situation is different: there the addition of Ⅎ yields new theorems in the Ⅎ-free fragment, but an axiomatisation is easily given. The proofs are syntactical. (shrink)

Propositional dynamic logic is complete but not compact. As a consequence, strong completeness requires an infinitary proof system. In this paper, we present a short proof for strong completeness of $$\mathsf{PDL}$$ relative to an infinitary proof system containing the rule from [α; β n ]φ for all $$n \in {\mathbb{N}}$$, conclude $$[\alpha;\beta^*] \varphi$$. The proof uses a universal canonical model, and it is generalized to other modal logics with infinitary proof rules, such as epistemic knowledge with common knowledge. Also, we (...) show that the universal canonical model of $$\mathsf{PDL}$$ lacks the property of modal harmony, the analogue of the Truth lemma for modal operators. (shrink)

In this rather technical paper we establish a useful combination of belief revision and verisimilitude according to which better theories provide better predictions, and revising with more verisimilar data results in theories that are closer to the truth. Moreover, this paper presents two alternative definitions of refined verisimilitude, which are more perspicuous than the algebraic version used in previous publications.

TAPP is a total applicative theory, conservative over intuitionistic arithmetic. In this paper, we first show that the same holds for TAPP+ the choice principle EAC; then we extend TAPP with choice sequences and study the principle EBIa0 . The resulting theories are used to characterise the arithmetical fragment of EL +EBIa0. As a digression, we use TAPP to show that P. Martin-Löf's basic extensional theory ML0 is conservative over intuitionistic arithmetic.

The Interpolation Theorem, first formulated and proved by W. Craig fifty years ago for predicate logic, has been extended to many other logical frameworks and is being applied in several areas of computer science. We give a short overview, and focus on the theory of software systems and modules. An algebra of theories TA is presented, with a nonstandard interpretation of the existential quantifier . In TA, the interpolation property of the underlying logic corresponds with the quantifier combination property . (...) It is shown how the Modularization Theorem, the Factorization Lemma and the Normal Form Theorem for module expressions can be proved in TA. (shrink)

We provide a strongly complete infinitary proof system for hybrid logic. This proof system can be extended with countably many sequents. Thus, although these logics may be non-compact, strong completeness proofs are provided for infinitary hybrid versions of non-compact logics like ancestral logic and Segerberg’s modal logic with the bounded chain condition. This extends the completeness result for hybrid logics by Gargov, Passy, and Tinchev.

In this rather technical paper we establish a useful combination of belief revision and verisimilitude according to which better theories provide better predictions, and revising with more verisimilar data results in theories that are closer to the truth. Moreover, this paper presents two alternative definitions of refined verisimilitude, which are more perspicuous than the algebraic version used in previous publications.

We show in this paper that all fragments of intuitionistic propostional logic based on a subset of the connectives $\wedge, \vee, \rightarrow, \neg$ satisfy interpolation. Fragments containing $\leftrightarrow$ or $\neg\neg$ are briefly considered.

The rapid innovations in digital technology deeply influence views on language and information processing. These exciting developments raise many questions for researchers, and shed new light on old approaches. Researchers are drawn to closely investigate the relation between form and content, the ways that linguistic utterances change information content, and the dynamics of information change. Logic, as an established method of valid argumentation, is a tool that researchers can use to gain insight in these questions of language and computation. In (...) answer to these linguistic and computational questions, this book presents a broad range of logical investigations into language and information processing. The topics surveyed include the notion of 'reasonable belief' in commonsense reasoning, perceptual reports in natural languages, and the logic of creation and modification of objects. The book also presents work on the verification of temporal aspects of reactive systems, analysis of scope by combining model theory and situation semantics and semantic analysis of the information articulation of linguistic statements. This volume exemplifies the abundant development of logical methods and tools in an interdisciplinary context. (shrink)

We show in this paper that all fragments of intuitionistic propostional logic based on a subset of the connectives $\wedge, \vee, \rightarrow, \neg$ satisfy interpolation. Fragments containing $\leftrightarrow$ or ¬¬ are briefly considered.

The Interpolation Theorem, first formulated and proved by W. Craig fifty years ago for predicate logic, has been extended to many other logical frameworks and is being applied in several areas of computer science. We give a short overview, and focus on the theory of software systems and modules. An algebra of theories TA is presented, with a nonstandard interpretation of the existential quantifier ∃. In TA, the interpolation property of the underlying logic corresponds with the quantifier combination property ∃Σ (...) ∃П S ≡ ∃(Σ ∪ П) S. It is shown how the Modularization Theorem, the Factorization Lemma and the Normal Form Theorem for module expressions can be proved in TA. (shrink)

Taxonomy Based modeling was applied to describe drivers' mental models of variable message signs (VMS's) displayed on expressways. Progress in road telematics has made it possible to introduce variable message signs (VMS's). Sensors embedded in the carriageway every 500m record certain variables (speed, flow rate, etc.) that are transformed in real time into 'driving times' to a given destination if road conditions do not change. VMS systems are auto-regulative Man-Machine (AMMI) systems which incorporate a model of the user: if the (...) traffic flow is too high, then drivers should choose alternative routes. In so doing, the traffic flow should decrease. The model of the user is based on suppositions such as: people do not like to waste time, they fully understand the displayed messages, they trust the displayed values, they know of alternative routes. However, people also have a model of the way the system functions. And if they do not believe the contents of the message, they will not act as expected. We collected data through interviews with drivers using the critical incidents technique (Flanagan, 1985). Results show that the mental models that drivers have of the way the VMS system works are various but not numerous and that most of them differ from the 'ideal expert' mental model. It is clear that users don't have an adequate model of how the VMS system works and that VMS planners have a model of user behaviour that does not correspond to the behaviour of the drivers we interviewed. Finally, Taxonomy Based Modeling is discussed as a tool for mental model remediation. (shrink)

Taxonomy Based modeling was applied to describe drivers’ mental models of variable message signs (VMS’s) displayed on expressways. Progress in road telematics has made it possible to introduce variable message signs (VMS’s). Sensors embedded in the carriageway every 500m record certain variables (speed, flow rate, etc.) that are transformed in real time into “driving times” to a given destination if road conditions do not change. VMS systems are auto-regulative Man-Machine (AMMI) systems which incorporate a model of the user: if the (...) traffic flow is too high, then drivers should choose alternative routes. In so doing, the traffic flow should decrease. The model of the user is based on suppositions such as: people do not like to waste time, they fully understand the displayed messages, they trust the displayed values, they know of alternative routes. However, people also have a model of the way the system functions. And if they do not believe the contents of the message, they will not act as expected. (shrink)

In 1995 Visser, van Benthem, de Jongh, and Renardel de Lavalette introduced NNIL-formulas, showing that these are exactly the formulas preserved under taking submodels of Kripke models. In this article we show that NNIL-formulas are up to frame equivalence the formulas preserved under taking subframes of frames, that NNIL-formulas are subframe formulas, and that subframe logics can be axiomatized by NNIL-formulas. We also define a new syntactic class of ONNILLI-formulas. We show that these are the formulas preserved in (...) monotonic images of frames and that ONNILLI-formulas are stable formulas as introduced by Bezhanishvili and Bezhanishvili in 2013. Thus, ONNILLI is a syntactically defined set of formulas axiomatizing all stable logics. This resolves a problem left open in 2013. (shrink)

This paper provides an exploratory comparative assessment of the institutional pressures influencing corporate social responsibility in a developed country, UK, vs. a developing country, Brazil, based on a survey of different actors. Information on sustainability concerns, organizational strategies and mechanisms of pressure was collected through interviews with environmental regulatory agencies, financial institutions, media and non-governmental organizations. Our results confirm that the more advanced awareness and CSR responsiveness in the UK is a consequence of a predominance of coercive and normative forces (...) on the organizational field. The institutional forces tend to build a Brazilian organizational field that is relational based and risk intensive. The findings lend support to the view that CSR responses are unlikely to be easily transformed into uniform standardized practices across the globe. This paper contributes to a collective understanding of the organizational field and a common template for CSR in the context of developed and developing countries. (shrink)

Lower levels of news use are generally understood to be associated with less political engagement among citizens. But while some people simply have a low preference for news, others avoid the news intentionally. So far little is known about the relationship between active news avoidance and civic engagement in society, a void this study has set out to fill. Based on a four-wave general population panel survey in the Netherlands, conducted between April and July 2020 (N = 1,084) during a (...) crisis situation, this research-in-brief investigates the development of news avoidance and pro-social civic engagement over time. Results suggest that higher news topic avoidance results in higher levels of civic engagement. The study discusses different explanations for why less news can mean more engagement. (shrink)

1. pte. Ideología elemental o lógica.--2. pte. Ideología abstractiva o metafísica.--3. pte. Ideología oratoria o retórica y Apéndice de documentos.